Probabilistic Variants of Rényi-ulam Game and Many-valued Logic
نویسندگان
چکیده
In this paper we discuss some generalizations of Rényi-Ulam game with lies: some of them are simply probabilistic variants of it, some others differ from it by the presence of more than one number to guess. In the last part of the paper, we also discuss the relationship between such variants and many-valued logic. This paper is just a survey of known results, but in its last part it also contains some plans for future research.
منابع مشابه
Probabilistic variants of Ulam’s game and many-valued logic
In this paper we discuss some generalizations of Ulam’s game with lies: some of them are simply probabilistic variants of it, some others differ from it by the presence of more than one number to guess. In the last part of the paper, we also discuss the relationship between such variants and many-valued logic. This paper is just a survey of known results, but in its last part it also contains s...
متن کاملProduct logic and probabilistic Ulam games
Connections between games and many-valued logic have been shown first by Mundici [M] for the case of the Rényi-Ulam game and à Lukasiewicz logic. Given a finite set Ω of cardinality N (called the search space) and a natural number n, the Rényi-Ulam game G(N,n) is the following: a player, called Responder, chooses an element of Ω called the secret. The other player, called Questioner, has to gue...
متن کاملA Lukasiewicz Logic Based Prolog
Prolog is a programming language based on a restricted subset of classical rst order predicate logic. In order to overcome some problems of classical logic to handle imperfect human knowledge, we provide a formal framework for a Lukasiewicz logic based Prolog system. The use of Lukasiewicz logic with its connection to Ulam games enables us to deal with partial inconsistencies by interpreting th...
متن کاملPropositional dynamic logic for searching games with errors
We investigate some finitely-valued generalizations of propositional dynamic logic with tests. We start by introducing the n+ 1valued Kripke models and a corresponding language based on a modal extension of Łukasiewicz many-valued logic. We illustrate the definitions by providing a framework for an analysis of the Rényi Ulam searching game with errors. Our main result is the axiomatization of t...
متن کاملMazur-Ulam theorem in probabilistic normed groups
In this paper, we give a probabilistic counterpart of Mazur-Ulam theorem in probabilistic normed groups. We show, under some conditions, that every surjective isometry between two probabilistic normed groups is a homomorphism.
متن کامل